Degree-equipartite graphs
نویسندگان
چکیده
منابع مشابه
Amalgamations of factorizations of complete equipartite graphs
Let t be a positive integer, and let L = (l1, . . . , lt) and K = (k1, . . . , kt) be collections of nonnegative integers. A graph has a (t,K,L) factorization if it can be represented as the edge-disjoint union of factors F1, . . . , Ft where, for 1 ≤ i ≤ t, Fi is ki-regular
متن کاملCycle decompositions of λ-fold complete equipartite graphs
In this paper we give constructions for various new fixed length cycle decompositions of λ-fold complete equipartite graphs. In particular, we determine necessary and sufficient conditions for the existence of such a decomposition in the case where the cycle length is prime.
متن کاملResolvable gregarious cycle decompositions of complete equipartite graphs
The complete multipartite graph Kn(m) with n parts of size m is shown to have a decomposition into n-cycles in such a way that each cycle meets each part of Kn(m); that is, each cycle is said to be gregarious. Furthermore, gregarious decompositions are given which are also resolvable. © 2007 Elsevier B.V. All rights reserved.
متن کاملDecomposing Complete Equipartite Graphs into Short Odd Cycles
In this paper we examine the problem of decomposing the lexicographic product of a cycle with an empty graph into cycles of uniform length. We determine necessary and sufficient conditions for a solution to this problem when the cycles are of odd length. We apply this result to find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in t...
متن کاملSome gregarious kite decompositions of complete equipartite graphs
A k-cycle decomposition of a multipartite graph G is said to be gregarious if each k-cycle in the decomposition intersects k distinct partite sets of G. In this paper we prove necessary and sufficient conditions for the existence of such a decomposition in the case where G is the complete equipartite graph, having n parts of size m, and either n ≡ 0, 1 (mod k), or k is odd and m ≡ 0 (mod k). As...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2011
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.02.018